Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,

The term Input/Output Automata refers to a family of system modeling frameworks based on interacting infinite-state machines. The models come in several flavors, based on which features (fairness, time, continuous behavior, probability, etc.) they can express. In each of these frameworks, automata can be composed in parallel to form more complex automata, and automata can be related using levels of abstraction. Properties of automata can be proved by hand or with the assistance of theorem-proving programs. The first framework of this kind, which appeared in 1987, was the basic fair asynchronous I/O automata modeling framework of Lynch and Tuttle. It was used originally to describe and analyze a simple network resource allocation algorithm at multiple levels of abstraction. Since then, I/O automata have been used extensively to model distributed algorithms and distributed systems, and even to prove impossibility results. For example, they have been used for algorithms that implement atomic shared memory and for systems that provide group communication services. Next came the “timed I/O automata” framework of Lynch and Vaandrager, which augmented the “unfair” portion of the basic model with time-passage steps. Timed I/O automata have been used to describe a variety of timing-based algorithms, including timeout-based failure detectors and consensus algorithms, communication protocols, and clock synchronization algorithms. They have also been used to analyze performance of many algorithms and systems. A more recent development was the “hybrid I/O automata” framework, which supports modeling and analysis of hybrid discrete/continuous systems. The main addition here is a set of trajectories, which can be used to describe the evolution of system state over intervals of time. Hybrid I/O automata have been used for many case studies, ranging from simple toy examples of vehicles on tracks to complex helicopter control applications. “Probabilistic I/O automata”, defined by Segala in 1995, allow probabilistic choice of the next state, in addition to nondeterministic choice. They have been used for describing and analyzing randomized distributed algorithms and security protocols. Finally, “dynamic I/O automata” were introduced recently by Attie; they add, to the basic “unfair” model, the capability for processes to create other processes and to destroy themselves. R. Amadio, D. Lugiez (Eds.): CONCUR 2003, LNCS 2761, pp. 191–192, 2003. c © Springer-Verlag Berlin Heidelberg 2003